State Space Reduction using Partial -Con uence
نویسندگان
چکیده
We present an e cient algorithm to determine the maximal class of con uent -transitions in a labelled transition system. Con uent -transitions are inert with respect to branching bisimulation. This allows to use -priorisation, which means that in a state with a con uent outgoing -transition all other transitions can be removed, maintaining branching bisimulation. In combination with the removal of -loops, and the compression of -sequences this yields an e cient algorithm to reduce the size of large state spaces. 2000 Mathematics Subject Classi cation: 68Q20, 68Q50.
منابع مشابه
Typing Confluence
We investigate con uence properties for concurrent systems of message-passing processes, because such properties have proved to be useful for a variety of applications, ranging from reasoning about concurrent objects to mobile and high-speed telecommunication protocols. Roughly, con uence means that for every two computations starting from a common system state, it is possible to continue the c...
متن کاملA geometric proof of con uence by decreasing diagrams
The criterion for con uence using decreasing diagrams is a generalization of several well-known con uence criteria in abstract rewriting, such as the strong con uence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of in nite reduction diagrams, arising from unsuccessful attempts to obtain a con uent diagram by tiling with elementary diagrams. 2000 Mathem...
متن کاملPartial Order Reduction in Directed Model Checking
Partial order reduction is a very succesful technique for avoid ing the state explosion problem that is inherent to explicit state model checking of asynchronous concurrent systems It exploits the commu tativity of concurrently executed transitions in interleaved system runs in order to reduce the size of the explored state space Directed model checking on the other hand addresses the state exp...
متن کاملA geometric proof of confluence by decreasing diagrams
The criterion for con uence using decreasing diagrams is a generalization of several well-known con uence criteria in abstract rewriting, such as the strong con uence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of in nite reduction diagrams, arising from unsuccessful attempts to obtain a con uent diagram by tiling with elementary diagrams. 2000 Mathem...
متن کاملThe Decidability of the Generalized Confluence Problem for Context-Free Languages
A language L is con uent with respect to a given quasi order on if, for any x; y 2 L, there is z 2 L such that x z and y z. L is con uent with respect to in generalized sense if it is a nite union of languages conuent with respect to . We investigate in this paper the decidability of the generalized con uence problem with respect to the pre x partial order and the factor partial order for conte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014